Quantum-resistance authentication in centralized cognitive radio networks
نویسندگان
چکیده
منابع مشابه
Hash Tree Algorithm for Centralized Cognitive Radio Networks
Hash tree is a tree in which every non-leaf node is labeled with the hash of the labels of its children nodes. Hash trees are useful because they allow efficient and secure verification of the contents of larger data structures. Hash trees are a generalization of hash lists and hash chains. Demonstrating that a leaf node is a part of the given hash tree requires processing an amount of data pro...
متن کاملA Fair Scheduling Model for Centralized Cognitive Radio Networks
We formulate throughput maximizing, max-min fair, weighted max-min fair, and proportionally fair scheduling problems for cognitive radio networks managed by a centralized cognitive base station. We propose a very general scheduling model accomplishing goals such as making frequency, time slot, and data rate allocation to secondary users with possibly multiple antennas, in a heterogenous multi-c...
متن کاملCentralized asynchronous broadcast in radio networks
We study asynchronous broadcasting in packet radio networks. A radio network is represented by a directed graph, in which one distinguished source node stores a message that needs to be disseminated among all the remaining nodes. An asynchronous execution of a protocol is a sequence of events, each consisting of simultaneous deliveries of messages. The correctness of protocols is considered for...
متن کاملCentralized and Decentralized Cognitive Radio Network Optimization
Cognitive Radio (CR) is an intelligent wireless communication system to solve spectral clogging problem and increasing bandwidth utilization for next generation wireless communication applications. Computationally and energy efficient spectrum sensing for detecting spectrum holes in wideband radio spectrum still remains a challenge. The cognitive nodes which are far away from primary user (PU) ...
متن کاملTime efficient centralized gossiping in radio networks
In this paper we study the gossiping problem (all-to-all communication) in radio networks where all nodes are aware of the network topology. We start our presentation with a deterministic gossiping algorithm that works in at most n units of time in any radio network of size n. This algorithm is optimal in the worst case scenario since there exist radio network topologies, such as lines, stars a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Security and Communication Networks
سال: 2016
ISSN: 1939-0114
DOI: 10.1002/sec.1408